Semiharmonic graphs with fixed cyclomatic number
نویسندگان
چکیده
Let the trunk of a graph G be the graph obtained by removing all leaves of G. We prove that, for every integer c ≥ 2, there are at most finitely many trunks of semiharmonic graphs with cyclomatic number c — in contrast to the fact established by the last two of the present authors in their paper Semiharmonic Bicyclic Graphs (this journal) that there are infinitely many connected semiharmonic graphs with given cyclomatic number. Further, we prove that there are at most finitely many semiharmonic but not almost semiregular graphs with cyclomatic number c. MSC Classification: 05C75
منابع مشابه
Semiharmonic bicyclic graphs
Classification of harmonic and semiharmonic graphs according to their cyclomatic number became of interest recently. All finite harmonic graphs with up to four independent cycles, as well as all finite semiharmonic graphs with at most one cycle were determined. Here, we determine all finite semiharmonic bicyclic graphs. Besides that, we present several methods to construct semiharmonic graphs f...
متن کاملGraphs with smallest forgotten index
The forgotten topological index of a molecular graph $G$ is defined as $F(G)=sum_{vin V(G)}d^{3}(v)$, where $d(u)$ denotes the degree of vertex $u$ in $G$. The first through the sixth smallest forgotten indices among all trees, the first through the third smallest forgotten indices among all connected graph with cyclomatic number $gamma=1,2$, the first through<br /...
متن کاملEdge Disjoint Paths and Multicut Problems in Graphs Generalizing the Trees∗
We generalize all the results obtained for maximum integer multiflow and minimum multicut problems in trees by Garg et al. [Primaldual approximation algorithms for integral flow and multicut in trees. Algorithmica 18 (1997) 3–20] to graphs with a fixed cyclomatic number, while this cannot be achieved for other classical generalizations of the trees. Moreover, we prove that the minimum multicut ...
متن کاملThe cyclicity of a hypergraph
The cyclicity of a hypergraph is an efficiently computable integer that extends the notion of the cyclomatic number of a graph. Generalizing the notion of the degree of a node in a graph, we define the star articulation degree of a subedge in a hypergraph, and then use it to set up the expression for the cyclicity. The basic properties of cyclicity are that it is zero on acyclic hypergraphs and...
متن کاملThe cyclicity of a hypergraph
The cyclicity of a hypergraph is an e ciently computable integer that extends the notion of the cyclomatic number of a graph The formula for the cyclicity is suggested by the join invariant of an acyclic hypergraph which is the multiset of all joining sets in any of its join trees Once we gure out how the multiplicity of a joining set depends on the structure of the acyclic hypergraph we de ne ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Appl. Math. Lett.
دوره 17 شماره
صفحات -
تاریخ انتشار 2004